Series operations using minimum storage
نویسندگان
چکیده
منابع مشابه
Minimum Relaxation N-body Simulations Using Orthogonal Series Force Computation
This report describes a modiication of the orthogonal function Poisson solver for n-body simulations that minimizes relaxation caused by small particle number uctuations. With the standard algorithm, the noise leading to relaxation can be reduced by making the expansion basis similar to the particle distribution and by carefully choosing the maximum order in the expansion. The proposed algorith...
متن کاملMinimum matrix representation of closure operations
Let (I be a column of the fft x /I matrix M and A a set of its columns. We say that A implies a iff M contains no two rows equal in A but different in a. It is easy IO see that if Y,~,(A) denotes . the columns implied by A, than :/,,,(A) is a closure operation. We say that M represents this closure operation. s(:/ ) is the minimum number of the rows of the matrices representing a given closure ...
متن کاملMinimum construction of two-qubit quantum operations.
Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal number of both two- and single-qubit gates. We show this by giving an analytic circuit that implements a generic nonlocal two-qubit operation from just two ap...
متن کاملRunge-Kutta methods with minimum storage implementations
Solution of partial differential equations by the method of lines requires the integration of large numbers of ordinary differential equations (ODEs). In such computations, storage requirements are typically one of the main considerations, especially if a high order ODE solver is required. We investigate Runge-Kutta methods that require only two storage locations per ODE. Existing methods of th...
متن کاملSearching for Minimum Storage Regenerating Codes
Regenerating codes allow distributed storage systems to recover from the loss of a storage node while transmitting the minimum possible amount of data across the network. We present a systematic computer search for optimal systematic regenerating codes. To search the space of potential codes, we reduce the potential search space in several ways. We impose an additional symmetry condition on cod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
سال: 1979
ISSN: 0334-2700,1839-4078
DOI: 10.1017/s0334270000001946